A Data Cube Algebra Engine for Data
نویسنده
چکیده
M.L. Kersten, A.P.J.M. Siebes CWI, Amsterdam, The Netherlands M. Holsheimer , F. Kwakkel Data Distilleries, Amsterdam, The Netherlands Abstract On line data mining products, such as Data Surveyor, illustrate that an extensible architecture to accommodate a variety of mining algorithms and database interconnectivity is technically feasible. In this paper we describe the interaction between Data Surveyor and its DBMS backends using an extended relational algebra, the Data Cube Algebra, to encode the mining requests. Subsequently, a drill engine produces optimized code for several database back-ends. Amongst others, the optimizer exploits commonalities amongst multiple query batches and target platform speci c optimizations rules. The e ectiveness of several strategies is illustrated using the Monet database engine.
منابع مشابه
Nested Data Cubes for OLAP
We present a new model for OLAP, called the nested data cube (NDC) model. Nested data cubes are a generalization of other OLAP models such as f-tables [3], and hypercubes [2], but also of classical structures such as sets, bags, and relations. The model we propose adds to the previous models mainly flexibility in viewing the data, in that it allows for the assignment of priorities to the differ...
متن کاملA Conceptual Model and Algebra for On-Line Analytical Processing in Data Warehouses
Data warehousing and On-Line Analytical Processing (OLAP) are two of the most signiicant new technologies in the business data processing arena. A data warehouse can be deened as a \very large" repository of historical data pertaining to an organization. OLAP refers to the technique of performing complex analysis over the information stored in a data warehouse. The complexity of queries require...
متن کاملA Fault-tolerant Multicast Routing Algorithm Based on Cube Algebra for Hypercube Networks
In this study a multicast routing algorithm has been developed for faulty hypercube parallel processing system using cube algebra. Without any restriction to the number of the faulty nodes, the routing from the source node to the destination node is implemented minimally. The developed routing algorithm has been visually simulated via prepared data routing simulator program. It has been observe...
متن کاملNested Data Cubes for OLAP ( extended
Nested data cubes (NDCs in short) are a generalization of other OLAP models such as f-tables 3] and hypercubes 2], but also of classical structures as sets, bags, and relations. This model adds to the previous models exibility in viewing the data, in that it allows for the assignment of priorities to the diierent dimensions of the multidimen-sional OLAP data. We also present an algebra in which...
متن کاملThe MD-join: An Operator for Complex OLAP
OLAP queries (i.e. group-by or cube-by queries with aggregation) have proven to be valuable for data analysis and exploration. Many decision support applications need very complex OLAP queries, requiring a fine degree of control over both the group definition and the aggregates that are computed. For example, suppose that the user has access to a data cube whose measure attribute is Sum(Sales)....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007